How to Synchronize the Activity of All Components of a P System?

We consider the problem of synchronizing the activity of all the membranes of a P system. After pointing at the connection with a similar problem dealt with in the field of cellular automata where the problem is called the firing squad synchronization problem, FSSP for short, we provide two algorithms to solve this problem. One algorithm is nondeterministic and it works in the time 3h, where h is the height of the tree defining the membrane structure of the considered P system. The other algorithm is deterministic and it works in time 4n + 2h, where n is the number of membranes of the considered P system. Finally, we suggest various directions to continue this work.